Comparative Speed Analysis of FastICA
نویسندگان
چکیده
FastICA is arguably one of the most widespread methods for independent component analysis. We focus on its deflation-based implementation, where the independent components are extracted one after another. The present contribution evaluates the method’s speed in terms of the overall computational complexity required to reach a given source extraction performance. FastICA is compared with a simple modification referred to as RobustICA, which merely consists of performing exact line search optimization of the kurtosis-based contrast function. Numerical results illustrate the speed limitations of FastICA.
منابع مشابه
Method Based on Improved Fastica-lsm for Harmonic Detection in Power System
This paper proposes a new method based on improved FastICA (fast independent component analysis)LSM (the least square method), in order to improve the accuracy and speed of harmonic detection in power system. This work ameliorates the traditional FastICA algorithm by defining the initial value of demixing matrix iteration, thus inducing the iteration times and eliminating the problem of higher-...
متن کاملICA-based EEG denoising: a comparative analysis of fifteen methods
Independent Component Analysis (ICA) plays an important role in biomedical engineering. Indeed, the complexity of processes involved in biomedicine and the lack of reference signals make this blind approach a powerful tool to extract sources of interest. However, in practice, only few ICA algorithms such as SOBI, (extended) InfoMax and FastICA are used nowadays to process biomedical signals. In...
متن کاملSpeeding Up FastICA by Mixture Random Pruning
We study and derive a method to speed up kurtosis-based FastICA in presence of information redundancy, i.e., for large samples. It consists in randomly decimating the data set as more as possible while preserving the quality of the reconstructed signals. By performing an analysis of the kurtosis estimator, we find the maximum reduction rate which guarantees a narrow confidence interval of such ...
متن کاملRandom Projections for Dimensionality Reduction in ICA
In this paper we present a technique to speed up ICA based on the idea of reducing the dimensionality of the data set preserving the quality of the results. In particular we refer to FastICA algorithm which uses the Kurtosis as statistical property to be maximized. By performing a particular Johnson-Lindenstrauss like projection of the data set, we find the minimum dimensionality reduction rate...
متن کاملA Comparative Study of Linear Subspace Analysis Methods for Face Recognition
Face recognition is a typical problem of pattern recognition and machine learning. Among these approaches to the problem of face recognition, subspace analysis gives the most promising results, and becomes one of the most popular methods. This paper researches typical subspace analysis approaches, based on the introduction of main approaches of linear subspace analysis, such as Principal Compon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007